A dense planar point set from iterated line intersections
نویسندگان
چکیده
منابع مشابه
A dense planar point set from iterated line intersections
Given S1, a starting set of points in the plane, not all on a line, we define a sequence of planar point sets {Si}∞i=1 as follows. With Si already determined, let Li be the set of all the lines determined by pairs of points from Si , and let Si+1 be the set of all the intersection points of lines in Li . We show that with the exception of some very particular starting configurations, the limiti...
متن کاملOn the density of iterated line segment intersections
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting pairs of points of ⋃i j=1 Sj , and let Si+1 be the set of intersection points of those line segments in Li, which cross but do not overlap. We show that with the exception of some starting configurations the set of all...
متن کاملColoring copoints of a planar point set
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gons in the point set. We prove an upper bound of 2k−1 on the size of a planar point set for which the graph has chromatic number k, matching the bound conjectured by Szekeres for the clique number. Constructions of Erdős...
متن کاملIterated Point-Line Configurations Grow Doubly-Exponentially
Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoičić (2003) showed that the limiting set is dense in the plane. We give doubly exponential upper and lower bounds on the number of points at each stage. The proof employs a variant of the Szemerédi-Trotter Theorem ...
متن کاملOff-line Dynamic Maintenance of the Width of a Planar Point Set
Agarwal, P.K. and M. Sharir, Off-line dynamic maintenance of the width of a planar point set, Computational Geometry: Theory and Applications 1 (1991) 65-78. In this paper we present an efficient algorithm for the off-line dynamic maintenance of the width of a planar point set in the following restricted case: We are given a real parameter W and a sequence X = (a,, , a,,) of n insert and delete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2004
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2003.10.002